Termination w.r.t. Q proof of TRS/TRCSREx6_GM04

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__c → a__f(g(c))
a__f(g(X)) → g(X)
mark(c) → a__c
mark(f(X)) → a__f(X)
mark(g(X)) → g(X)
a__c → c
a__f(X) → f(X)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a__c → a__f(g(c))
a__f(g(X)) → g(X)
mark(c) → a__c
mark(f(X)) → a__f(X)
mark(g(X)) → g(X)
a__c → c
a__f(X) → f(X)

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

mark₁ > a_{_c} > [a_{_f₁}, g_1] > f₁
mark₁ > a_{_c} > c > f₁

Status:

mark₁: [1]
a_{_f₁}: [1]
c: multiset
f₁: [1]
a_{_c}: multiset
g₁: [1]